An Enhancement to the Iterative, Alpha-Beta, Minimax Search Procedure
نویسندگان
چکیده
منابع مشابه
A Minimax Algorithm Faster than Alpha-Beta
We present two recursive state space search algorithms that are based on SSS* and Dual*. Both dominate Alpha-Beta on a node count basis and one of them is always faster in searching random trees. These results have been derived on arti cial game trees with negligible leaf node evaluation time. For practical applications with more complex leaf evaluation functions we conjecture that our recursiv...
متن کاملA Minimax Algorithm Better than Alpha-Beta?
This paper has three main contributions to our understanding of fixed-depth minimax search: (A) A new formulation for Stockman’s SSS* algorithm, based on Alpha-Beta, is presented. It solves all the perceived drawbacks of SSS*, finally transforming it into a practical algorithm. In effect, we show that SSS* = α-β + transposition tables. The crucial step is the realization that transposition tabl...
متن کامل(\alpha, \beta) Fibonacci Search
Knuth [12, Page 417] states that “the (program of the) Fibonaccian search technique looks very mysterious at first glance” and that “it seems to work by magic”. In this work, we show that there is even more magic in Fibonaccian (or else Fibonacci) search. We present a generalized Fibonacci procedure that follows perfectly the implicit optimal decision tree for search problems where the cost of ...
متن کاملThe *-Minimax Search Procedure for Trees Containing Chance Nodes
An extention of the alpha-beta tree priming strategy to game trees with "probability" nodes, whose values are defined as the (possibly weighted) average of their successors' values, is developed. These '*-minhnax' trees pertain to games involving chance but no concealed infornzation. Based upon our search strategy, )re formulate and then analyze several algorithnzs for *-minimax trees. An initi...
متن کاملAn iterative procedure to solve HJBI
In this paper, an iterative algorithm to solve a special class of Hamilton-JacobiBellman-Isaacs (HJBI) equations is proposed. By constructing two series of nonnegative functions, we replace the problem of solving an HJBI equation by the problem of solving a sequence of Hamilton-Jacobi-Bellman (HJB) equations whose solutions can be approximated recursively by existing methods. The local converge...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ICGA Journal
سال: 1982
ISSN: 2468-2438,1389-6911
DOI: 10.3233/icg-1982-5107